منابع مشابه
Microhomology-Mediated Intron Loss during Metazoan Evolution
How introns are lost from eukaryotic genomes during evolution remains an enigmatic question in biology. By comparative genome analysis of five Caenorhabditis and eight Drosophila species, we found that the likelihood of intron loss is highly influenced by the degree of sequence homology at exon-intron junctions: a significant elevated degree of microhomology was observed for sequences immediate...
متن کاملConflicting phylogenetic signals at the base of the metazoan tree.
A phylogenetic framework is essential for under-standing the origin and evolution of metazoan development. Despite a number of recent molecular studies and a rich fossil record of sponges and cnidarians, the evolutionary relationships of the early branching metazoan groups to each other and to a putative outgroup, the choanoflagellates, remain uncertain. This situation may be the result of the ...
متن کاملNear Best Tree Approximation
Tree approximation is a form of nonlinear wavelet approximation that appears naturally in applications such as image compression and entropy encoding. The distinction between tree approximation and the more familiar n-term wavelet approximation is that the wavelets appearing in the approximant are required to align themselves in a certain connected tree sturcture. This makes their positions eas...
متن کاملCleavage patterns and the topology of the metazoan tree of life.
Several major alliances of metazoan phyla have been identified by small subunit rRNA sequence comparisons. It is possible to arrange the phyla to produce a parsimonious distribution of cleavage types, requiring only one change from a radial ancestral condition to spiral cleavage and one other to "idiosyncratic" cleavage; this arrangement is consistent with most of the recent molecular phylogeni...
متن کاملNear-Optimal Distributed Tree Embedding
Tree embeddings are a powerful tool in the area of graph approximation algorithms. Roughly speaking, they transform problems on general graphs into much easier ones on trees. Fakcharoenphol, Rao, and Talwar (FRT) [STOC’04] present a probabilistic tree embedding that transforms n-node metrics into (probability distributions over) trees, while stretching each pairwise distance by at most anO(log ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Phylogenetics and Evolution
سال: 2013
ISSN: 1055-7903
DOI: 10.1016/j.ympev.2012.11.012